- algorithmic universality
- Математика: алгоритмическая универсальность
Универсальный англо-русский словарь. Академик.ру. 2011.
algorithmic universality
Смотреть что такое "algorithmic universality" в других словарях:
Chaitin's constant — In the computer science subfield of algorithmic information theory, a Chaitin constant or halting probability is a real number that informally represents the probability that a randomly constructed program will halt. These numbers are formed from … Wikipedia
Turing completeness — For the usage of this term in the theory of relative computability by oracle machines, see Turing reduction. In computability theory, a system of data manipulation rules (such as an instruction set, a programming language, or a cellular… … Wikipedia
Arrow's impossibility theorem — In social choice theory, Arrow’s impossibility theorem, the General Possibility Theorem, or Arrow’s paradox, states that, when voters have three or more distinct alternatives (options), no voting system can convert the ranked preferences of… … Wikipedia
Simulated reality — is the proposition that reality could be simulated perhaps by computer simulation to a degree indistinguishable from true reality. It could contain conscious minds which may or may not be fully aware that they are living inside a simulation. This … Wikipedia
Small cancellation theory — In the mathematical subject of group theory, small cancellation theory studies groups given by group presentations satisfying small cancellation conditions, that is where defining relations have small overlaps with each other. It turns out that… … Wikipedia
Natural computing — For the scientific journal, see Natural Computing (journal). Natural computing, also called Natural computation, is a terminology introduced to encompass three classes of methods: 1) those that take inspiration from nature for the development of… … Wikipedia
Diophantine equation — In mathematics, a Diophantine equation is an indeterminate polynomial equation that allows the variables to be integers only. Diophantine problems have fewer equations than unknown variables and involve finding integers that work correctly for… … Wikipedia
Mathematical constant — A mathematical constant is a special number, usually a real number, that is significantly interesting in some way .[1] Constants arise in many different areas of mathematics, with constants such as e and π occurring in such diverse contexts as… … Wikipedia
Digital philosophy — is a direction in philosophy and cosmology advocated by certain mathematicians and theoretical physicists, e.g., Gregory Chaitin, Edward Fredkin, Stephen Wolfram, and Konrad Zuse (see his Calculating Space). Digital philosophy grew out of an… … Wikipedia
